首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   105篇
  免费   19篇
  国内免费   5篇
  2022年   4篇
  2020年   2篇
  2019年   3篇
  2017年   5篇
  2016年   5篇
  2015年   1篇
  2014年   6篇
  2013年   9篇
  2012年   9篇
  2011年   9篇
  2010年   4篇
  2009年   6篇
  2008年   3篇
  2007年   8篇
  2006年   7篇
  2005年   6篇
  2004年   6篇
  2003年   8篇
  2002年   3篇
  2001年   3篇
  2000年   4篇
  1999年   1篇
  1998年   5篇
  1997年   4篇
  1996年   1篇
  1994年   1篇
  1993年   1篇
  1992年   2篇
  1991年   1篇
  1990年   2篇
排序方式: 共有129条查询结果,搜索用时 31 毫秒
91.
胡庆军 《国防科技大学学报》1996,18(3):142-146 ,156
给出判别实对称矩阵为正定、半正定、负定、半负定或不定的一个算法;采用选最大对角元的方法,可使数值计算稳定性好。讨论了该算法的运算量,得到乘除法和加减法总次数分别至多为n(n-1)(n+4)/6和n(n-1)(n+1)/6的结论。最后给出运行该算法的数值例子。  相似文献   
92.
We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
93.
缩略型用语在越来越多的情况下被采用。其形式多样,运用灵活,较好地满足了军事语言中管理、宣讲、文秘、研究等语体紧缩、精练的要求。伴随着这一语用形式的不断拓展,规范化使用已成为急需解决的一个重要问题。为此,应深入分析“×个×”型军事缩略名称的特点,总结归纳其主要类型,准确把握缩略语在运用时应注意的问题。  相似文献   
94.
为适应装备型号需求生成的复杂性,必须开发面向作战能力应用的装备型号体系结构模型。按照装备型号需求生成工程化思想,建立了结构化的装备型号体系结构开发流程,并对每个环节进行了系统分析。装备型号作战体系结构和系统体系结构开发流程都划分为8个环节,为作战活动分析、系统功能分析提供了可追溯、可验证的模块化开发模式。装备型号体系结构关联开发流程分为4个环节,实现了作战能力对系统实体的关联关系,确保了系统需求对作战需求的支持,提高了装备型号需求成果的系统性和正确性。  相似文献   
95.
保障性住房建设是我国当前重要的民生问题,其中套型设计是保障性住房建设的主要内容。作为代表模式,研究重庆保障性住房套型特点和优化措施对提升我国保障性住房设计质量具有一定的借鉴和示范意义。在分析影响重庆保障性住房设计的国家宏观住房政策、规范与标准等相关因素的基础上,以重庆保障性住房典型开发项目为案例,着重论述重庆保障性住房套型的平面布局、类型与面积标准、功能构成与空间尺度的主要特点与不足,并从合理确定得房率、空间复合、精细化设计和节能技术推行等4个方面提出优化重庆保障性住房套型紧凑性、灵活性、舒适性和节能性的理念与方法。  相似文献   
96.
低入射余角下雷达地杂波反射率模型   总被引:6,自引:0,他引:6  
在常用雷达地杂波反射率模型的基础上,综合考虑雷达频率、地形种类和入射余角等对地杂波反射率的影响,建立了一个低入射余角下雷达地杂波反射率模型,并在不同的情况下,该模型与其他常用地杂波反射率模型相比较。结果表明:该雷达地杂波反射率模型更符合实际,进而证明了该模型的有效性和实用性。  相似文献   
97.
A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
98.
The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
99.
根据单一流空情的特点,立足贴近实战的要求,分别建立了空袭批数模型、航路生成模型、批次序号模型、类别指数模型、任务指数模型、编队数目模型和干扰模型共7个模型,并且按人工给定航路的方法进行了单一流空情生成的仿真实验,验证了该模型与以往模型相比具有一定的进步性,对防空兵作战仿真系统的开发具有一定的参考价值。  相似文献   
100.
The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号